Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes

نویسنده

  • Christian Deppe
چکیده

In this paper we determine the minimal number of yes–no queries that are needed to nd an unknown integer between 1 and N , if at most three of the answers are lies. This strategy is also an optimal adaptive strategy for binary three-error-correcting codes. c © 2000 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Extension of Error Correcting Output Codes

Error correcting output codes (ECOC) represent a successful extension of binary classifiers to address the multiclass problem. In this paper, we propose a novel technique called ECOC-ONE (Optimal Node Embedding) to improve an initial ECOC configuration defining a strategy to create new dichotomies and improve optimally the performance. The process of searching for new dichotomies is guided by t...

متن کامل

Optimal Extension of Error Correcting Output Codes

Error correcting output codes (ECOC) represent a successful extension of binary classifiers to address the multiclass problem. In this paper, we propose a novel technique called ECOC-ONE (Optimal Node Embedding) to improve an initial ECOC configuration defining a strategy to create new dichotomies and improve optimally the performance. The process of searching for new dichotomies is guided by t...

متن کامل

Problem-dependent designs for Error Correcting Output Codes

Error correcting output codes (ECOC) represent a successful extension of binary classifiers to address the multiclass problem. In this paper, we propose a novel technique called ECOCONE (Optimal Node Embedding) to improve an initial ECOC configuration defining a strategy to create new dichotomies and improve optimally the performance. The process of searching for new dichotomies is guided by th...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

On The Generalization of Error - Correcting WOM

WOM (Write Once Memory) codes are codes for efficiently storing and updating data in a memory whose state transition is irreversible. Storage media that can be classified as WOM includes flash memories, optical disks and punch cards. Error-correcting WOM codes can correct errors besides its regular data updating capability. They are increasingly important for electronic memories using MLCs (mul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 224  شماره 

صفحات  -

تاریخ انتشار 2000